Simple Seeding of Evolutionary Algorithms for Hard Multiobjective Minimization Problems

نویسنده

  • Klaus Truemper
چکیده

The paper describes a simple seeding method to be used with evolutionary algorithms for the solution of hard multiobjective minimization problems. Included are computational results for a speci c implementation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

متن کامل

OPTIMAL CONSTRAINED DESIGN OF STEEL STRUCTURES BY DIFFERENTIAL EVOLUTIONARY ALGORITHMS

Structural optimization, when approached by conventional (gradient based) minimization algorithms presents several difficulties, mainly related to computational aspects for the huge number of nonlinear analyses required, that regard both Objective Functions (OFs) and Constraints. Moreover, from the early '80s to today's, Evolutionary Algorithms have been successfully developed and applied as a ...

متن کامل

A multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project

This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...

متن کامل

Tchebycheff Method-based Evolutionary Algorithm for Multiobjective Optimization

RAO, SUNIL, MURALI. Tchebycheff Method-based Evolutionary Algorithm for Multiobjective Optimization (Under the direction of Dr. Ranji Ranjithan) In the operations research literature, the Tchebycheff method has been demonstrated to be a useful approach for exploring the non-dominated solutions for multiobjective optimization problems. While this method has been investigated with mathematical pr...

متن کامل

Constraint Method-Based Evolutionary Algorithm (CMEA) for Multiobjective Optimization

Evolutionary algorithms are becoming increasingly valuable in solving large-scale, realistic engineering multiobjective optimization (MO) problems, which typically require consideration of conflicting and competing design issues. The new procedure, Constraint Method-Based Evolutionary Algorithm (CMEA), presented in this paper is based upon underlying concepts in the constraint method described ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014